| Definitions | f(a), P   Q,  x:A. B(x), {x:A| B(x)} ,  , type List, x:A  B(x),  b, x(s), R-Feasible(R), R ||- es.P(es), A || B, scheme-compatible(A;B), namer-disjoint(n1;n2;nmr1;nmr2), False,  A, A  B,  , namer-shift(n;namer), s = t, x:A  B(x), ES, Consistent(R;es), P & Q, Type,  ,  x.A(x), EqDecider(T), Unit, left + right, IdLnk, Id, EOrderAxioms(E; pred?; info), EState(T), Knd, kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r s,  , constant_function(f;A;B), Top, S  T,  x. t(x), A B, as @ bs, <a, b>, True,  T, a < b, Void, #$n, left  right, let x,y,z = a in t(x;y;z), RealizerScheme{i:l}(), S |-es.P(es), scheme-plus(A;B), n+m, Namer(n;Id_list), t  T, [], {i..j }, i j < k, Inj(A;B;f), Atom$n, (x l), ||as||, A c B, P  Q, P Q |